on a relation between szeged and wiener indices of bipartite graphs
Authors
abstract
hansen et. al., using the autographix software package, conjectured that the szeged index $sz(g)$ and the wiener index $w(g)$ of a connected bipartite graph $g$ with $n geq 4$ vertices and $m geq n$ edges, obeys the relation $sz(g)-w(g) geq 4n-8$. moreover, this bound would be the best possible. this paper offers a proof to this conjecture.
similar resources
On a Relation between Szeged and Wiener Indices of Bipartite Graphs
Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index Sz(G) and the Wiener index W (G) of a connected bipartite graph G with n ≥ 4 vertices and m ≥ n edges, obeys the relation Sz(G) − W (G) ≥ 4n − 8. Moreover, this bound would be the best possible. This paper offers a proof to this conjecture.
full textRelation Between Wiener, Szeged and Detour Indices
In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.
full textRelationship between Edge Szeged and Edge Wiener Indices of Graphs
Let G be a connected graph and ξ(G) = Sze(G)−We(G), where We(G) denotes the edge Wiener index and Sze(G) denotes the edge Szeged index of G. In an earlier paper, it is proved that if T is a tree then Sze(T ) = We(T ). In this paper, we continue our work to prove that for every connected graph G, Sze(G) ≥ We(G) with equality if and only if G is a tree. We also classify all graphs with ξ(G) ≤ 5. ...
full textrelation between wiener, szeged and detour indices
in theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. among them wiener, szeged and detour indices play significant roles in anticipating chemical phenomena. in the present paper, we study these topological indices with respect to their difference number.
full textA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
full textComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
full textMy Resources
Save resource for easier access later
Journal title:
transactions on combinatoricsPublisher: university of isfahan
ISSN 2251-8657
volume 1
issue 4 2013
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023